A survey on the Chvátal-Erdös theorem
نویسنده
چکیده
In 1857, the Irish mathematician Sir William Hamilton(1805-1865) invented a game of travelling around the edges of a graph from vertex to vertex. Hamilton described the game, in a letter to his friend Graves, as a mathematical game on the dodecahedron in which one person sticks five pins in any five consecutive vertices and the other is required to complete the path to form a spanning cycle. In other words, given a particular graph to begin with, the objective of the game was to find a path in the graph which passes through each vertex exactly once. Such a graph is called a Hamiltonian graph. For a long time there was no elegant characterization of Hamiltonian graphs, although several necessary and sufficient conditions were known. Interested readers may consult graph theory books by Bondy and Murty[3], Harary [10] and Diestel [7] for relevant materials. First, let us present a useful necessary condition:
منابع مشابه
Erdös problem on point sets - a survey
This is a comprehensive survey on an interesting problem in combinatorial geometry first proposed by Erdös. The last most thorough survey in this area was by Morris and Soltan [20]. There has been a significant development in this area after this. In this survey, we present problems regarding point sets with (i) convex empty polygons and (ii) point subsets having a specified number of interior ...
متن کاملA Taste of Erdös on Interpolation
We discuss a few of Erdösresults on Lagrange interpolation, and then focus on some of the rami cations of the Erdös-Turan Theorem on Mean Convergence of Lagrange interpolation.
متن کاملDirichlet Sets and Erdös-kunen-mauldin Theorem
By a theorem proved by Erdös, Kunen and Mauldin, for any nonempty perfect set P on the real line there exists a perfect set M of Lebesgue measure zero such that P +M = R. We prove a stronger version of this theorem in which the obtained perfect set M is a Dirichlet set. Using this result we show that the ideal of additive sets for any family generated by analytic subgroups of the reals contains...
متن کاملOn Some Numbers Related to the Erdös-Szekeres Theorem
A crossing family of segments is a collection of segments each pair of which crosses. Given positive integers and , a grid is the union of two pairwise-disjoint collections of segments (with and members, respectively) such that each segment in the first collection crosses all members of the other. Let j
متن کامل